A Scrutiny of Frederickson’s Distributed Breadth-First Search Algorithm
نویسنده
چکیده
Frederickson outlined a distributed breadth-first search (BFS) algorithm which constructs a BFS tree in levels. The description of the algorithm is short and first-in-first-out (FIFO) channels are assumed. In this paper, we present a detailed description of a modified verison of the algorithm and we show that the algorithm functions in a non-FIFO environment. To allow a programmer to implement the algorithm, pseudocode of the adapted algorithm is provided.
منابع مشابه
Compression and Sieve: Reducing Communication in Parallel Breadth First Search on Distributed Memory Systems
For parallel breadth first search (BFS) algorithm on large-scale distributed memory systems, communication often costs significantly more than arithmetic and limits the scalability of the algorithm. In this paper we sufficiently reduce the communication cost in distributed BFS by compressing and sieving the messages. First, we leverage a bitmap compression algorithm to reduce the size of messag...
متن کاملChapter 5 Asynchronous P Systems
In this paper, the authors propose a new approach to fully asynchronous P systems, and a matching complexity measure, both inspired from the field of distributed algorithms. The authors validate the proposed approach by implementing several well-known distributed depth-first search (DFS) and breadth-first search (BFS) algorithms. Empirical results show that the proposed P algorithms have shorte...
متن کاملAsynchronous P Systems
In this paper, the authors propose a new approach to fully asynchronous P systems, and a matching complexity measure, both inspired from the field of distributed algorithms. The authors validate the proposed approach by implementing several well-known distributed depth-first search (DFS) and breadth-first search (BFS) algorithms. Empirical results show that the proposed P algorithms have shorte...
متن کاملEnumerating Global States of a Distributed Computation
Global predicate detection is a fundamental problem in distributed computing in the areas of distributed debugging and software fault-tolerance. It requires searching the global state lattice of a computation to determine if any consistent global state satisfies the given predicate. We give an efficient algorithm that perform the lex traversal of the lattice. We also give a space efficient algo...
متن کاملA Self-Stabilizing Distributed Algorithm to Construct BFS Spanning Trees of a Symmetric Graph
We propose a simple and eecient self-stabilizing distributed algorithm to construct the breadth rst search (BFS) spanning tree of an arbitrary connected symmetric graph. We develop a completely new direct approach of graph theoretical reasoning to prove the correctness of our algorithm. The approach seems to have potential to have applications in proving correctness of other self-stabilizing al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009